Optimization of polyhedral terrains
نویسنده
چکیده
منابع مشابه
Smoothing Imprecise 1.5D Terrains
We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains, where an imprecise terrain is given by...
متن کاملSmoothing Imprecise 1.5d Teeeains *
We study optimization problems for polyhedral terrains in the presence of data imprecision. An imprecise terrain is given by a triangulated point set where the height component of the vertices is specified by an interval of possible values. We restrict ourselves to terrains with a one-dimensional projection, usually referred to as 1.5-dimensional terrains, where an imprecise terrain is given by...
متن کاملExperimental Verification of a Realistic Input Model for Polyhedral Terrains
A realistic input model for polyhedral terrains was introduced in [16]. With this model, improved upper and lower bounds on the combinatorial complexity of visibility and distance structures on these terrains were obtained. In this paper, we perform experiments with realworld data to determine how realistic the assumptions of that input model are, by examining what the values of the model param...
متن کاملF G Representing the Visibility Structure of a Polyhedral Terrain through a Horizon Map : Digital Terrain Models, Visibility, Data Structures, Horizons : a Horizon-based Visibility Map for Terrains
horizon map Representing the Visibility Structure of a Polyhedral Terrain through a Horizon Map We present a model for describing the visibility of a polyhedral terrain from a xed viewpoint, based on a collection of nested horizons. We brie y introduce the concepts of mathematical and digital terrain models, and some background notions for visibility problems on terrains. Then, we de ne horizon...
متن کاملMatching Terrains under a Linear Transformation∗
We study the problem of matching two polyhedral terrains, where one can be changed vertically by a linear transformation of the third coordinate (scaling and translation). We give an algorithm that minimizes the maximum distance over all linear transformations in O(npolylog n) expected time. We also study matching two 1-dimensional terrains, and give a (1+ ε)-approximation algorithm for minimiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009